On Composition of Authenticated Byzantine Generals Or Should Not Hard Work Always Pay in All Environments?

نویسندگان

  • Anuj Gupta
  • Prasant Gopal
  • Piyush Bansal
  • Kannan Srinathan
چکیده

Consider a player who diligently executes (only) the delegated protocol but the adversary steals some private information from him. Should such a player be considered faulty? In a stand alone execution model, the answer can be either yes or no depending on the context/settings. However, with respect to composition of protocols, we show that the answer has to be no even though the literature answers this as yes. We show that an affirmative answer to this question leads to several undesirable side effects. In light of these findings we propose a new model to study composition of protocols. For our study we use the problem of parallel composition of Authenticated Byzantine Generals (ABG) as a case study. In our model we show that in spite of using unique session identifiers, if n < 2t, there cannot exist any ABG protocol that composes in parallel even twice. Further, for n ≥ 2t, we design ABG protocols that compose for any number of parallel executions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Look at Composition of Authenticated Byzantine Generals

The problem of Authenticated Byzantine Generals (ABG) aims to simulate a virtual reliable broadcast channel from the General to all the players via a protocol over a real (point-to-point) network in the presence of faults. We propose a new model to study the self-composition of ABG protocols. The central dogma of our approach can be phrased as follows: Consider a player who diligently executes ...

متن کامل

Authenticated Byzantine Generals in Dual Failure Model

Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BGP among n players tolerating up to t faults is (efficiently) possible if and only if n > 3t. To overcome this severe limitation, Pease et al. introduced a variant of BGP, Authenticated Byzantine General (ABG). Here play...

متن کامل

Byzantine Fault Tolerance, from Theory to Reality

Since its introduction nearly 20 years ago, the Byzantine Generals Problem has been the subject of many papers having the scrutiny of the fault tolerance community. Numerous Byzantine tolerant algorithms and architectures have been proposed. However, this problem is not yet sufficiently understood by those who design, build, and maintain systems with high dependability requirements. Today, ther...

متن کامل

On Byzantine generals with alternative plans

This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all loyal generals agree on a good plan proposed by a loyal general, and never on a bad plan.

متن کامل

Optimized Authenticated Self-synchronizing Byzantine Agreement Protocols

In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic Byzantine agreement protocols (BAPs) can be applied. Many BAPs found in literature require that communication takes place in synchronized rounds of information exchange and require that all correct processors know the start of the BAP and start the protocol simultaneously. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009